Termination of the given ITRSProblem could not be shown:
↳ ITRS
↳ ITRStoQTRSProof
ITRS problem:
The following domains are used:
z
The TRS R consists of the following rules:
Cond_log(TRUE, x, y) → +@z(1@z, log(/@z(-@z(x, y), y), y))
Cond_log1(TRUE, y) → 0@z
log(x, y) → Cond_log(&&(>=@z(x, 2@z), >=@z(y, 2@z)), x, y)
log(1@z, y) → Cond_log1(>=@z(y, 2@z), y)
The set Q consists of the following terms:
Cond_log(TRUE, x0, x1)
Cond_log1(TRUE, x0)
log(x0, x1)
Represented integers and predefined function symbols by Terms
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, x, y) → PLUS_INT(pos(s(0)), log(div_int(minus_int(x, y), y), y))
COND_LOG(true, x, y) → LOG(div_int(minus_int(x, y), y), y)
COND_LOG(true, x, y) → DIV_INT(minus_int(x, y), y)
COND_LOG(true, x, y) → MINUS_INT(x, y)
LOG(x, y) → COND_LOG(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
LOG(x, y) → AND(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0)))))
LOG(x, y) → GREATEREQ_INT(x, pos(s(s(0))))
LOG(x, y) → GREATEREQ_INT(y, pos(s(s(0))))
LOG(pos(s(0)), y) → COND_LOG1(greatereq_int(y, pos(s(s(0)))), y)
LOG(pos(s(0)), y) → GREATEREQ_INT(y, pos(s(s(0))))
PLUS_INT(pos(x), neg(y)) → MINUS_NAT(x, y)
PLUS_INT(neg(x), pos(y)) → MINUS_NAT(y, x)
PLUS_INT(neg(x), neg(y)) → PLUS_NAT(x, y)
PLUS_INT(pos(x), pos(y)) → PLUS_NAT(x, y)
PLUS_NAT(s(x), y) → PLUS_NAT(x, y)
MINUS_NAT(s(x), s(y)) → MINUS_NAT(x, y)
DIV_INT(pos(x), pos(s(y))) → DIV_NAT(x, s(y))
DIV_INT(pos(x), neg(s(y))) → DIV_NAT(x, s(y))
DIV_INT(neg(x), pos(s(y))) → DIV_NAT(x, s(y))
DIV_INT(neg(x), neg(s(y))) → DIV_NAT(x, s(y))
DIV_NAT(s(x), s(y)) → IF(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
DIV_NAT(s(x), s(y)) → GREATEREQ_INT(pos(x), pos(y))
DIV_NAT(s(x), s(y)) → DIV_NAT(minus_nat_s(x, y), s(y))
DIV_NAT(s(x), s(y)) → MINUS_NAT_S(x, y)
GREATEREQ_INT(pos(s(x)), pos(s(y))) → GREATEREQ_INT(pos(x), pos(y))
GREATEREQ_INT(neg(s(x)), neg(s(y))) → GREATEREQ_INT(neg(x), neg(y))
MINUS_NAT_S(s(x), s(y)) → MINUS_NAT_S(x, y)
MINUS_INT(pos(x), pos(y)) → MINUS_NAT(x, y)
MINUS_INT(neg(x), neg(y)) → MINUS_NAT(y, x)
MINUS_INT(neg(x), pos(y)) → PLUS_NAT(x, y)
MINUS_INT(pos(x), neg(y)) → PLUS_NAT(x, y)
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, x, y) → PLUS_INT(pos(s(0)), log(div_int(minus_int(x, y), y), y))
COND_LOG(true, x, y) → LOG(div_int(minus_int(x, y), y), y)
COND_LOG(true, x, y) → DIV_INT(minus_int(x, y), y)
COND_LOG(true, x, y) → MINUS_INT(x, y)
LOG(x, y) → COND_LOG(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
LOG(x, y) → AND(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0)))))
LOG(x, y) → GREATEREQ_INT(x, pos(s(s(0))))
LOG(x, y) → GREATEREQ_INT(y, pos(s(s(0))))
LOG(pos(s(0)), y) → COND_LOG1(greatereq_int(y, pos(s(s(0)))), y)
LOG(pos(s(0)), y) → GREATEREQ_INT(y, pos(s(s(0))))
PLUS_INT(pos(x), neg(y)) → MINUS_NAT(x, y)
PLUS_INT(neg(x), pos(y)) → MINUS_NAT(y, x)
PLUS_INT(neg(x), neg(y)) → PLUS_NAT(x, y)
PLUS_INT(pos(x), pos(y)) → PLUS_NAT(x, y)
PLUS_NAT(s(x), y) → PLUS_NAT(x, y)
MINUS_NAT(s(x), s(y)) → MINUS_NAT(x, y)
DIV_INT(pos(x), pos(s(y))) → DIV_NAT(x, s(y))
DIV_INT(pos(x), neg(s(y))) → DIV_NAT(x, s(y))
DIV_INT(neg(x), pos(s(y))) → DIV_NAT(x, s(y))
DIV_INT(neg(x), neg(s(y))) → DIV_NAT(x, s(y))
DIV_NAT(s(x), s(y)) → IF(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
DIV_NAT(s(x), s(y)) → GREATEREQ_INT(pos(x), pos(y))
DIV_NAT(s(x), s(y)) → DIV_NAT(minus_nat_s(x, y), s(y))
DIV_NAT(s(x), s(y)) → MINUS_NAT_S(x, y)
GREATEREQ_INT(pos(s(x)), pos(s(y))) → GREATEREQ_INT(pos(x), pos(y))
GREATEREQ_INT(neg(s(x)), neg(s(y))) → GREATEREQ_INT(neg(x), neg(y))
MINUS_NAT_S(s(x), s(y)) → MINUS_NAT_S(x, y)
MINUS_INT(pos(x), pos(y)) → MINUS_NAT(x, y)
MINUS_INT(neg(x), neg(y)) → MINUS_NAT(y, x)
MINUS_INT(neg(x), pos(y)) → PLUS_NAT(x, y)
MINUS_INT(pos(x), neg(y)) → PLUS_NAT(x, y)
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 7 SCCs with 23 less nodes.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
MINUS_NAT_S(s(x), s(y)) → MINUS_NAT_S(x, y)
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
MINUS_NAT_S(s(x), s(y)) → MINUS_NAT_S(x, y)
R is empty.
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
MINUS_NAT_S(s(x), s(y)) → MINUS_NAT_S(x, y)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- MINUS_NAT_S(s(x), s(y)) → MINUS_NAT_S(x, y)
The graph contains the following edges 1 > 1, 2 > 2
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
GREATEREQ_INT(neg(s(x)), neg(s(y))) → GREATEREQ_INT(neg(x), neg(y))
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
GREATEREQ_INT(neg(s(x)), neg(s(y))) → GREATEREQ_INT(neg(x), neg(y))
R is empty.
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ UsableRulesReductionPairsProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
GREATEREQ_INT(neg(s(x)), neg(s(y))) → GREATEREQ_INT(neg(x), neg(y))
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the usable rules with reduction pair processor [LPAR04] with a polynomial ordering [POLO], all dependency pairs and the corresponding usable rules [FROCOS05] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.
The following dependency pairs can be deleted:
GREATEREQ_INT(neg(s(x)), neg(s(y))) → GREATEREQ_INT(neg(x), neg(y))
No rules are removed from R.
Used ordering: POLO with Polynomial interpretation [POLO]:
POL(GREATEREQ_INT(x1, x2)) = 2·x1 + x2
POL(neg(x1)) = x1
POL(s(x1)) = 2·x1
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ UsableRulesReductionPairsProof
↳ QDP
↳ PisEmptyProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
P is empty.
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
GREATEREQ_INT(pos(s(x)), pos(s(y))) → GREATEREQ_INT(pos(x), pos(y))
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
GREATEREQ_INT(pos(s(x)), pos(s(y))) → GREATEREQ_INT(pos(x), pos(y))
R is empty.
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ UsableRulesReductionPairsProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
GREATEREQ_INT(pos(s(x)), pos(s(y))) → GREATEREQ_INT(pos(x), pos(y))
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the usable rules with reduction pair processor [LPAR04] with a polynomial ordering [POLO], all dependency pairs and the corresponding usable rules [FROCOS05] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.
The following dependency pairs can be deleted:
GREATEREQ_INT(pos(s(x)), pos(s(y))) → GREATEREQ_INT(pos(x), pos(y))
No rules are removed from R.
Used ordering: POLO with Polynomial interpretation [POLO]:
POL(GREATEREQ_INT(x1, x2)) = 2·x1 + x2
POL(pos(x1)) = x1
POL(s(x1)) = 2·x1
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ UsableRulesReductionPairsProof
↳ QDP
↳ PisEmptyProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
P is empty.
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
DIV_NAT(s(x), s(y)) → DIV_NAT(minus_nat_s(x, y), s(y))
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
DIV_NAT(s(x), s(y)) → DIV_NAT(minus_nat_s(x, y), s(y))
The TRS R consists of the following rules:
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
DIV_NAT(s(x), s(y)) → DIV_NAT(minus_nat_s(x, y), s(y))
The TRS R consists of the following rules:
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
The set Q consists of the following terms:
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
DIV_NAT(s(x), s(y)) → DIV_NAT(minus_nat_s(x, y), s(y))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [POLO]:
POL(0) = 0
POL(DIV_NAT(x1, x2)) = x1
POL(minus_nat_s(x1, x2)) = x1
POL(s(x1)) = 1 + x1
The following usable rules [FROCOS05] were oriented:
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_nat_s(0, s(y)) → 0
minus_nat_s(x, 0) → x
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
P is empty.
The TRS R consists of the following rules:
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
The set Q consists of the following terms:
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
MINUS_NAT(s(x), s(y)) → MINUS_NAT(x, y)
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
MINUS_NAT(s(x), s(y)) → MINUS_NAT(x, y)
R is empty.
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
MINUS_NAT(s(x), s(y)) → MINUS_NAT(x, y)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- MINUS_NAT(s(x), s(y)) → MINUS_NAT(x, y)
The graph contains the following edges 1 > 1, 2 > 2
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
PLUS_NAT(s(x), y) → PLUS_NAT(x, y)
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
PLUS_NAT(s(x), y) → PLUS_NAT(x, y)
R is empty.
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
PLUS_NAT(s(x), y) → PLUS_NAT(x, y)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- PLUS_NAT(s(x), y) → PLUS_NAT(x, y)
The graph contains the following edges 1 > 1, 2 >= 2
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, x, y) → LOG(div_int(minus_int(x, y), y), y)
LOG(x, y) → COND_LOG(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
The TRS R consists of the following rules:
Cond_log(true, x, y) → plus_int(pos(s(0)), log(div_int(minus_int(x, y), y), y))
Cond_log1(true, y) → pos(0)
log(x, y) → Cond_log(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
log(pos(s(0)), y) → Cond_log1(greatereq_int(y, pos(s(s(0)))), y)
plus_int(pos(x), neg(y)) → minus_nat(x, y)
plus_int(neg(x), pos(y)) → minus_nat(y, x)
plus_int(neg(x), neg(y)) → neg(plus_nat(x, y))
plus_int(pos(x), pos(y)) → pos(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(neg(0), pos(0)) → true
greatereq_int(neg(0), neg(y)) → true
greatereq_int(pos(x), neg(y)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(neg(x), pos(s(y))) → false
greatereq_int(neg(s(x)), pos(0)) → false
greatereq_int(neg(s(x)), neg(0)) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
greatereq_int(neg(s(x)), neg(s(y))) → greatereq_int(neg(x), neg(y))
if(true, x, y) → x
if(false, x, y) → y
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, x, y) → LOG(div_int(minus_int(x, y), y), y)
LOG(x, y) → COND_LOG(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
Cond_log(true, x0, x1)
Cond_log1(true, x0)
log(x0, x1)
plus_int(pos(x0), neg(x1))
plus_int(neg(x0), pos(x1))
plus_int(neg(x0), neg(x1))
plus_int(pos(x0), pos(x1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, x, y) → LOG(div_int(minus_int(x, y), y), y)
LOG(x, y) → COND_LOG(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
In the following pairs the term without variables pos(s(s(0))) is replaced by the fresh variable x_removed.
Pair: LOG(x, y) → COND_LOG(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
Positions in right side of the pair: The new variable was added to all pairs as a new argument[CONREM].
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ QDP
↳ RemovalProof
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, x, y, x_removed) → LOG(div_int(minus_int(x, y), y), y, x_removed)
LOG(x, y, x_removed) → COND_LOG(and(greatereq_int(x, x_removed), greatereq_int(y, x_removed)), x, y, x_removed)
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
In the following pairs the term without variables pos(s(s(0))) is replaced by the fresh variable x_removed.
Pair: LOG(x, y) → COND_LOG(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y)
Positions in right side of the pair: The new variable was added to all pairs as a new argument[CONREM].
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, x, y, x_removed) → LOG(div_int(minus_int(x, y), y), y, x_removed)
LOG(x, y, x_removed) → COND_LOG(and(greatereq_int(x, x_removed), greatereq_int(y, x_removed)), x, y, x_removed)
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule LOG(x, y) → COND_LOG(and(greatereq_int(x, pos(s(s(0)))), greatereq_int(y, pos(s(s(0))))), x, y) at position [0] we obtained the following new rules [LPAR04]:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(y0, pos(0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, pos(0))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, x, y) → LOG(div_int(minus_int(x, y), y), y)
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(y0, pos(0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, pos(0))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By instantiating [LPAR04] the rule COND_LOG(true, x, y) → LOG(div_int(minus_int(x, y), y), y) we obtained the following new rules [LPAR04]:
COND_LOG(true, neg(z0), z1) → LOG(div_int(minus_int(neg(z0), z1), z1), z1)
COND_LOG(true, z0, pos(0)) → LOG(div_int(minus_int(z0, pos(0)), pos(0)), pos(0))
COND_LOG(true, pos(s(z0)), z1) → LOG(div_int(minus_int(pos(s(z0)), z1), z1), z1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
COND_LOG(true, pos(0), z0) → LOG(div_int(minus_int(pos(0), z0), z0), z0)
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(y0, pos(0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, pos(0))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, neg(z0), z1) → LOG(div_int(minus_int(neg(z0), z1), z1), z1)
COND_LOG(true, z0, pos(0)) → LOG(div_int(minus_int(z0, pos(0)), pos(0)), pos(0))
COND_LOG(true, pos(s(z0)), z1) → LOG(div_int(minus_int(pos(s(z0)), z1), z1), z1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
COND_LOG(true, pos(0), z0) → LOG(div_int(minus_int(pos(0), z0), z0), z0)
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule LOG(y0, pos(0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, pos(0)) at position [0] we obtained the following new rules [LPAR04]:
LOG(neg(x0), pos(0)) → COND_LOG(and(false, false), neg(x0), pos(0))
LOG(pos(0), pos(0)) → COND_LOG(and(false, false), pos(0), pos(0))
LOG(pos(s(x0)), pos(0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), pos(0))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, neg(z0), z1) → LOG(div_int(minus_int(neg(z0), z1), z1), z1)
COND_LOG(true, z0, pos(0)) → LOG(div_int(minus_int(z0, pos(0)), pos(0)), pos(0))
COND_LOG(true, pos(s(z0)), z1) → LOG(div_int(minus_int(pos(s(z0)), z1), z1), z1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
COND_LOG(true, pos(0), z0) → LOG(div_int(minus_int(pos(0), z0), z0), z0)
LOG(neg(x0), pos(0)) → COND_LOG(and(false, false), neg(x0), pos(0))
LOG(pos(0), pos(0)) → COND_LOG(and(false, false), pos(0), pos(0))
LOG(pos(s(x0)), pos(0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), pos(0))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 3 less nodes.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, neg(z0), z1) → LOG(div_int(minus_int(neg(z0), z1), z1), z1)
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, pos(s(z0)), z1) → LOG(div_int(minus_int(pos(s(z0)), z1), z1), z1)
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
COND_LOG(true, pos(0), z0) → LOG(div_int(minus_int(pos(0), z0), z0), z0)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
LOG(pos(s(x0)), pos(0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), pos(0))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule COND_LOG(true, neg(z0), z1) → LOG(div_int(minus_int(neg(z0), z1), z1), z1) at position [] we obtained the following new rules [LPAR04]:
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, pos(s(z0)), z1) → LOG(div_int(minus_int(pos(s(z0)), z1), z1), z1)
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
COND_LOG(true, pos(0), z0) → LOG(div_int(minus_int(pos(0), z0), z0), z0)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
LOG(pos(s(x0)), pos(0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), pos(0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule COND_LOG(true, pos(s(z0)), z1) → LOG(div_int(minus_int(pos(s(z0)), z1), z1), z1) at position [] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(s(y0)), pos(x1)) → LOG(div_int(minus_nat(s(y0), x1), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(plus_nat(s(y0), x1)), neg(x1)), neg(x1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
COND_LOG(true, pos(0), z0) → LOG(div_int(minus_int(pos(0), z0), z0), z0)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
LOG(pos(s(x0)), pos(0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), pos(0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), pos(x1)) → LOG(div_int(minus_nat(s(y0), x1), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(plus_nat(s(y0), x1)), neg(x1)), neg(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(plus_nat(s(y0), x1)), neg(x1)), neg(x1)) at position [0,0,0] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
COND_LOG(true, pos(0), z0) → LOG(div_int(minus_int(pos(0), z0), z0), z0)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
LOG(pos(s(x0)), pos(0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), pos(0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), pos(x1)) → LOG(div_int(minus_nat(s(y0), x1), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule COND_LOG(true, pos(0), z0) → LOG(div_int(minus_int(pos(0), z0), z0), z0) at position [] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(plus_nat(0, x1)), neg(x1)), neg(x1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
LOG(pos(s(x0)), pos(0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), pos(0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), pos(x1)) → LOG(div_int(minus_nat(s(y0), x1), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(plus_nat(0, x1)), neg(x1)), neg(x1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(plus_nat(0, x1)), neg(x1)), neg(x1)) at position [0,0,0] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(x1), neg(x1)), neg(x1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
LOG(pos(s(x0)), pos(0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), pos(0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), pos(x1)) → LOG(div_int(minus_nat(s(y0), x1), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(x1), neg(x1)), neg(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule COND_LOG(true, pos(s(y0)), pos(x1)) → LOG(div_int(minus_nat(s(y0), x1), pos(x1)), pos(x1)) at position [] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
COND_LOG(true, pos(s(x0)), pos(0)) → LOG(div_int(pos(s(x0)), pos(0)), pos(0))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
LOG(pos(s(x0)), pos(0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), pos(0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(x1), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
COND_LOG(true, pos(s(x0)), pos(0)) → LOG(div_int(pos(s(x0)), pos(0)), pos(0))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(x1), neg(x1)), neg(x1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By instantiating [LPAR04] the rule LOG(pos(0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), pos(0), y1) we obtained the following new rules [LPAR04]:
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(0), pos(s(z1)))
LOG(pos(0), neg(z1)) → COND_LOG(and(false, greatereq_int(neg(z1), pos(s(s(0))))), pos(0), neg(z1))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(x1), neg(x1)), neg(x1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(0), pos(s(z1)))
LOG(pos(0), neg(z1)) → COND_LOG(and(false, greatereq_int(neg(z1), pos(s(s(0))))), pos(0), neg(z1))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(0), pos(s(z1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(x1), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(0), pos(s(z1))) at position [0,1] we obtained the following new rules [LPAR04]:
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(x1), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule LOG(y0, neg(x0)) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), false), y0, neg(x0)) at position [0] we obtained the following new rules [LPAR04]:
LOG(neg(x0), neg(y1)) → COND_LOG(and(false, false), neg(x0), neg(y1))
LOG(pos(0), neg(y1)) → COND_LOG(and(false, false), pos(0), neg(y1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), neg(x1)) → LOG(div_int(pos(x1), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(x0), neg(y1)) → COND_LOG(and(false, false), neg(x0), neg(y1))
LOG(pos(0), neg(y1)) → COND_LOG(and(false, false), pos(0), neg(y1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 3 less nodes.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule LOG(neg(x0), y1) → COND_LOG(and(false, greatereq_int(y1, pos(s(s(0))))), neg(x0), y1) at position [0] we obtained the following new rules [LPAR04]:
LOG(neg(y0), neg(x0)) → COND_LOG(and(false, false), neg(y0), neg(x0))
LOG(neg(y0), pos(0)) → COND_LOG(and(false, false), neg(y0), pos(0))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
LOG(neg(y0), neg(x0)) → COND_LOG(and(false, false), neg(y0), neg(x0))
LOG(neg(y0), pos(0)) → COND_LOG(and(false, false), neg(y0), pos(0))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 3 less nodes.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule COND_LOG(true, z0, neg(z1)) → LOG(div_int(minus_int(z0, neg(z1)), neg(z1)), neg(z1)) at position [0] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(x0), neg(x1)) → LOG(div_int(pos(plus_nat(x0, x1)), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
COND_LOG(true, pos(x0), neg(x1)) → LOG(div_int(pos(plus_nat(x0, x1)), neg(x1)), neg(x1))
COND_LOG(true, neg(x0), neg(x1)) → LOG(div_int(minus_nat(x1, x0), neg(x1)), neg(x1))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(x0), neg(x1)) → LOG(div_int(pos(plus_nat(x0, x1)), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
The TRS R consists of the following rules:
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), neg(y)) → minus_nat(y, x)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), neg(y)) → pos(plus_nat(x, y))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(neg(x), neg(s(y))) → pos(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(x0), neg(x1)) → LOG(div_int(pos(plus_nat(x0, x1)), neg(x1)), neg(x1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule COND_LOG(true, pos(x0), neg(x1)) → LOG(div_int(pos(plus_nat(x0, x1)), neg(x1)), neg(x1)) at position [0] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(s(x0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(x0, x1))), neg(x1)), neg(x1))
COND_LOG(true, pos(0), neg(x0)) → LOG(div_int(pos(x0), neg(x0)), neg(x0))
COND_LOG(true, pos(y0), neg(s(x1))) → LOG(neg(div_nat(plus_nat(y0, s(x1)), s(x1))), neg(s(x1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, pos(0), neg(x0)) → LOG(div_int(pos(x0), neg(x0)), neg(x0))
COND_LOG(true, pos(y0), neg(s(x1))) → LOG(neg(div_nat(plus_nat(y0, s(x1)), s(x1))), neg(s(x1)))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By narrowing [LPAR04] the rule LOG(pos(0), pos(z1)) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(s(0))))), pos(0), pos(z1)) at position [0] we obtained the following new rules [LPAR04]:
LOG(pos(0), pos(0)) → COND_LOG(and(false, false), pos(0), pos(0))
LOG(pos(0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), pos(0), pos(s(x0)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
LOG(pos(0), pos(0)) → COND_LOG(and(false, false), pos(0), pos(0))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By instantiating [LPAR04] the rule COND_LOG(true, neg(x0), pos(x1)) → LOG(div_int(neg(plus_nat(x0, x1)), pos(x1)), pos(x1)) we obtained the following new rules [LPAR04]:
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(div_int(neg(plus_nat(x0, s(z1))), pos(s(z1))), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(div_int(neg(plus_nat(x0, s(z1))), pos(s(z1))), pos(s(z1)))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule COND_LOG(true, neg(x0), pos(s(z1))) → LOG(div_int(neg(plus_nat(x0, s(z1))), pos(s(z1))), pos(s(z1))) at position [0] we obtained the following new rules [LPAR04]:
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1)
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By instantiating [LPAR04] the rule LOG(pos(s(x0)), y1) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(y1, pos(s(s(0))))), pos(s(x0)), y1) we obtained the following new rules [LPAR04]:
LOG(pos(s(x0)), neg(z1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(neg(z1), pos(s(s(0))))), pos(s(x0)), neg(z1))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(s(x0)), pos(s(z1)))
LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
LOG(pos(s(x0)), neg(z1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(neg(z1), pos(s(s(0))))), pos(s(x0)), neg(z1))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(s(x0)), pos(s(z1)))
LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(z1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(neg(z1), pos(s(s(0))))), pos(s(x0)), neg(z1))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(z1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(neg(z1), pos(s(s(0))))), pos(s(x0)), neg(z1))
The TRS R consists of the following rules:
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
and(false, false) → false
and(true, false) → false
greatereq_int(pos(x), pos(0)) → true
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, true) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
LOG(pos(s(x0)), neg(z1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(neg(z1), pos(s(s(0))))), pos(s(x0)), neg(z1))
The TRS R consists of the following rules:
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
and(false, false) → false
and(true, false) → false
greatereq_int(pos(x), pos(0)) → true
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, true) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule LOG(pos(s(x0)), neg(z1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(neg(z1), pos(s(s(0))))), pos(s(x0)), neg(z1)) at position [0,1] we obtained the following new rules [LPAR04]:
LOG(pos(s(x0)), neg(z1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(z1))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
The TRS R consists of the following rules:
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
and(false, false) → false
and(true, false) → false
greatereq_int(pos(x), pos(0)) → true
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, true) → false
and(true, true) → true
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDPOrderProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
The TRS R consists of the following rules:
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
and(false, false) → false
and(true, false) → false
greatereq_int(pos(x), pos(0)) → true
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
COND_LOG(true, pos(s(y0)), neg(x1)) → LOG(div_int(pos(s(plus_nat(y0, x1))), neg(x1)), neg(x1))
The remaining pairs can at least be oriented weakly.
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
Used ordering: Polynomial interpretation [POLO]:
POL(0) = 0
POL(COND_LOG(x1, x2, x3)) = x1
POL(LOG(x1, x2)) = 0
POL(and(x1, x2)) = 0
POL(div_int(x1, x2)) = 0
POL(div_nat(x1, x2)) = 0
POL(false) = 0
POL(greatereq_int(x1, x2)) = 1
POL(if(x1, x2, x3)) = x2 + x3
POL(minus_nat_s(x1, x2)) = 0
POL(neg(x1)) = 0
POL(plus_nat(x1, x2)) = 0
POL(pos(x1)) = 0
POL(s(x1)) = 0
POL(true) = 1
The following usable rules [FROCOS05] were oriented:
and(false, false) → false
and(true, false) → false
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
LOG(pos(s(x0)), neg(y1)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), false), pos(s(x0)), neg(y1))
The TRS R consists of the following rules:
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
and(false, false) → false
and(true, false) → false
greatereq_int(pos(x), pos(0)) → true
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(s(x0)), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0))
The TRS R consists of the following rules:
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
div_int(pos(x), neg(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
greatereq_int(neg(x), pos(s(y))) → false
and(false, false) → false
and(false, true) → false
and(true, false) → false
and(true, true) → true
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(s(x0)), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(s(x0)), pos(s(z1))) at position [0,1] we obtained the following new rules [LPAR04]:
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By instantiating [LPAR04] the rule COND_LOG(true, pos(0), pos(x1)) → LOG(div_int(minus_nat(0, x1), pos(x1)), pos(x1)) we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(0), pos(s(z1))) → LOG(div_int(minus_nat(0, s(z1)), pos(s(z1))), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
COND_LOG(true, pos(0), pos(s(z1))) → LOG(div_int(minus_nat(0, s(z1)), pos(s(z1))), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule COND_LOG(true, pos(0), pos(s(z1))) → LOG(div_int(minus_nat(0, s(z1)), pos(s(z1))), pos(s(z1))) at position [0,0] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(0), pos(s(z1))) → LOG(div_int(neg(s(z1)), pos(s(z1))), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
COND_LOG(true, pos(0), pos(s(z1))) → LOG(div_int(neg(s(z1)), pos(s(z1))), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule COND_LOG(true, pos(0), pos(s(z1))) → LOG(div_int(neg(s(z1)), pos(s(z1))), pos(s(z1))) at position [0] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(0), pos(s(z1))) → LOG(neg(div_nat(s(z1), s(z1))), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
COND_LOG(true, pos(0), pos(s(z1))) → LOG(neg(div_nat(s(z1), s(z1))), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule COND_LOG(true, pos(0), pos(s(z1))) → LOG(neg(div_nat(s(z1), s(z1))), pos(s(z1))) at position [0,0] we obtained the following new rules [LPAR04]:
COND_LOG(true, pos(0), pos(s(z1))) → LOG(neg(if(greatereq_int(pos(z1), pos(z1)), div_nat(minus_nat_s(z1, z1), s(z1)), 0)), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
COND_LOG(true, pos(0), pos(s(z1))) → LOG(neg(if(greatereq_int(pos(z1), pos(z1)), div_nat(minus_nat_s(z1, z1), s(z1)), 0)), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By instantiating [LPAR04] the rule LOG(pos(s(x0)), pos(z0)) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z0), pos(s(s(0))))), pos(s(x0)), pos(z0)) we obtained the following new rules [LPAR04]:
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(s(x0)), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
COND_LOG(true, pos(0), pos(s(z1))) → LOG(neg(if(greatereq_int(pos(z1), pos(z1)), div_nat(minus_nat_s(z1, z1), s(z1)), 0)), pos(s(z1)))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(s(x0)), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [LPAR04] the rule LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(s(z1)), pos(s(s(0))))), pos(s(x0)), pos(s(z1))) at position [0,1] we obtained the following new rules [LPAR04]:
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ QDPOrderProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
COND_LOG(true, pos(0), pos(s(z1))) → LOG(neg(if(greatereq_int(pos(z1), pos(z1)), div_nat(minus_nat_s(z1, z1), s(z1)), 0)), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
COND_LOG(true, pos(0), pos(s(z1))) → LOG(neg(if(greatereq_int(pos(z1), pos(z1)), div_nat(minus_nat_s(z1, z1), s(z1)), 0)), pos(s(z1)))
The remaining pairs can at least be oriented weakly.
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
Used ordering: Polynomial interpretation [POLO]:
POL(0) = 0
POL(COND_LOG(x1, x2, x3)) = x2
POL(LOG(x1, x2)) = x1
POL(and(x1, x2)) = 0
POL(div_int(x1, x2)) = x1
POL(div_nat(x1, x2)) = 0
POL(false) = 1
POL(greatereq_int(x1, x2)) = 1 + x2
POL(if(x1, x2, x3)) = 0
POL(minus_int(x1, x2)) = x1
POL(minus_nat(x1, x2)) = 1
POL(minus_nat_s(x1, x2)) = 0
POL(neg(x1)) = 0
POL(plus_nat(x1, x2)) = 1 + x1 + x2
POL(pos(x1)) = 1
POL(s(x1)) = 1
POL(true) = 0
The following usable rules [FROCOS05] were oriented:
minus_nat(s(x), s(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(0, 0) → pos(0)
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
LOG(pos(0), pos(s(z1))) → COND_LOG(and(false, greatereq_int(pos(z1), pos(s(0)))), pos(0), pos(s(z1)))
LOG(neg(y0), pos(s(x0))) → COND_LOG(and(false, greatereq_int(pos(x0), pos(s(0)))), neg(y0), pos(s(x0)))
The remaining pairs can at least be oriented weakly.
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
Used ordering: Polynomial interpretation [POLO]:
POL(0) = 0
POL(COND_LOG(x1, x2, x3)) = x1
POL(LOG(x1, x2)) = x2
POL(and(x1, x2)) = x1
POL(div_int(x1, x2)) = 0
POL(div_nat(x1, x2)) = 0
POL(false) = 0
POL(greatereq_int(x1, x2)) = x2
POL(if(x1, x2, x3)) = 0
POL(minus_int(x1, x2)) = 0
POL(minus_nat(x1, x2)) = 0
POL(minus_nat_s(x1, x2)) = 0
POL(neg(x1)) = 0
POL(plus_nat(x1, x2)) = 0
POL(pos(x1)) = 1
POL(s(x1)) = 0
POL(true) = 1
The following usable rules [FROCOS05] were oriented:
and(true, true) → true
and(true, false) → false
greatereq_int(neg(x), pos(s(y))) → false
and(false, true) → false
and(false, false) → false
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
LOG(pos(s(x0)), pos(s(z1))) → COND_LOG(and(greatereq_int(pos(x0), pos(s(0))), greatereq_int(pos(z1), pos(s(0)))), pos(s(x0)), pos(s(z1)))
The remaining pairs can at least be oriented weakly.
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
Used ordering: Matrix interpretation [MATRO]:
| POL(LOG(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(COND_LOG(x1, x2, x3)) = | | · | x1 | + | | + | | · | x2 | + | | · | x3 |
| POL(and(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(greatereq_int(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(div_int(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(minus_int(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(div_nat(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(plus_nat(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(minus_nat(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(if(x1, x2, x3)) = | | · | x1 | + | | + | | · | x2 | + | | · | x3 |
| POL(minus_nat_s(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
The following usable rules [FROCOS05] were oriented:
minus_nat(s(x), s(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
minus_int(pos(x), pos(y)) → minus_nat(x, y)
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
if(false, x, y) → y
if(true, x, y) → x
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(0, 0) → pos(0)
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
div_nat(0, s(y)) → 0
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
COND_LOG(true, pos(s(x0)), pos(s(x1))) → LOG(div_int(minus_nat(x0, x1), pos(s(x1))), pos(s(x1)))
The remaining pairs can at least be oriented weakly.
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
Used ordering: Matrix interpretation [MATRO]:
| POL(LOG(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(COND_LOG(x1, x2, x3)) = | | · | x1 | + | | + | | · | x2 | + | | · | x3 |
| POL(and(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(greatereq_int(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(div_int(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(minus_int(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(div_nat(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(plus_nat(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(minus_nat(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
| POL(if(x1, x2, x3)) = | | · | x1 | + | | + | | · | x2 | + | | · | x3 |
| POL(minus_nat_s(x1, x2)) = | | · | x1 | + | | + | | · | x2 |
The following usable rules [FROCOS05] were oriented:
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
if(false, x, y) → y
if(true, x, y) → x
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
div_nat(0, s(y)) → 0
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
COND_LOG(true, neg(x0), pos(s(z1))) → LOG(neg(div_nat(plus_nat(x0, s(z1)), s(z1))), pos(s(z1)))
The remaining pairs can at least be oriented weakly.
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
Used ordering: Polynomial interpretation [POLO]:
POL(0) = 0
POL(COND_LOG(x1, x2, x3)) = x1
POL(LOG(x1, x2)) = x1
POL(and(x1, x2)) = x1
POL(div_int(x1, x2)) = 1
POL(div_nat(x1, x2)) = 1
POL(false) = 0
POL(greatereq_int(x1, x2)) = x1
POL(if(x1, x2, x3)) = x2 + x3
POL(minus_int(x1, x2)) = 0
POL(minus_nat(x1, x2)) = 0
POL(minus_nat_s(x1, x2)) = 0
POL(neg(x1)) = 0
POL(plus_nat(x1, x2)) = 0
POL(pos(x1)) = 1
POL(s(x1)) = 0
POL(true) = 1
The following usable rules [FROCOS05] were oriented:
and(true, true) → true
and(true, false) → false
greatereq_int(neg(x), pos(s(y))) → false
and(false, true) → false
and(false, false) → false
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
COND_LOG(true, z0, pos(s(z1))) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)))
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
In the following pairs the term without variables pos(s(s(0))) is replaced by the fresh variable x_removed.
Pair: LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
Positions in right side of the pair: The new variable was added to all pairs as a new argument[CONREM].
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ RemovalProof
↳ QDP
↳ RemovalProof
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0)), x_removed) → COND_LOG(and(greatereq_int(y0, x_removed), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)), x_removed)
COND_LOG(true, z0, pos(s(z1)), x_removed) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)), x_removed)
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.
In the following pairs the term without variables pos(s(s(0))) is replaced by the fresh variable x_removed.
Pair: LOG(y0, pos(s(x0))) → COND_LOG(and(greatereq_int(y0, pos(s(s(0)))), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)))
Positions in right side of the pair: The new variable was added to all pairs as a new argument[CONREM].
↳ ITRS
↳ ITRStoQTRSProof
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ Narrowing
↳ QDP
↳ Instantiation
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Rewriting
↳ QDP
↳ Instantiation
↳ QDP
↳ Rewriting
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ RemovalProof
↳ RemovalProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
LOG(y0, pos(s(x0)), x_removed) → COND_LOG(and(greatereq_int(y0, x_removed), greatereq_int(pos(x0), pos(s(0)))), y0, pos(s(x0)), x_removed)
COND_LOG(true, z0, pos(s(z1)), x_removed) → LOG(div_int(minus_int(z0, pos(s(z1))), pos(s(z1))), pos(s(z1)), x_removed)
The TRS R consists of the following rules:
minus_nat(0, 0) → pos(0)
minus_nat(0, s(y)) → neg(s(y))
minus_nat(s(x), 0) → pos(s(x))
minus_nat(s(x), s(y)) → minus_nat(x, y)
div_int(pos(x), pos(s(y))) → pos(div_nat(x, s(y)))
div_int(neg(x), pos(s(y))) → neg(div_nat(x, s(y)))
div_nat(0, s(y)) → 0
div_nat(s(x), s(y)) → if(greatereq_int(pos(x), pos(y)), div_nat(minus_nat_s(x, y), s(y)), 0)
greatereq_int(pos(x), pos(0)) → true
greatereq_int(pos(0), pos(s(y))) → false
greatereq_int(pos(s(x)), pos(s(y))) → greatereq_int(pos(x), pos(y))
minus_nat_s(x, 0) → x
minus_nat_s(0, s(y)) → 0
minus_nat_s(s(x), s(y)) → minus_nat_s(x, y)
if(true, x, y) → x
if(false, x, y) → y
and(false, false) → false
and(false, true) → false
minus_int(pos(x), pos(y)) → minus_nat(x, y)
minus_int(neg(x), pos(y)) → neg(plus_nat(x, y))
plus_nat(0, x) → x
plus_nat(s(x), y) → s(plus_nat(x, y))
and(true, false) → false
and(true, true) → true
greatereq_int(neg(x), pos(s(y))) → false
The set Q consists of the following terms:
plus_nat(0, x0)
plus_nat(s(x0), x1)
minus_nat(0, 0)
minus_nat(0, s(x0))
minus_nat(s(x0), 0)
minus_nat(s(x0), s(x1))
div_int(pos(x0), pos(s(x1)))
div_int(pos(x0), neg(s(x1)))
div_int(neg(x0), pos(s(x1)))
div_int(neg(x0), neg(s(x1)))
div_nat(0, s(x0))
div_nat(s(x0), s(x1))
greatereq_int(pos(x0), pos(0))
greatereq_int(neg(0), pos(0))
greatereq_int(neg(0), neg(x0))
greatereq_int(pos(x0), neg(x1))
greatereq_int(pos(0), pos(s(x0)))
greatereq_int(neg(x0), pos(s(x1)))
greatereq_int(neg(s(x0)), pos(0))
greatereq_int(neg(s(x0)), neg(0))
greatereq_int(pos(s(x0)), pos(s(x1)))
greatereq_int(neg(s(x0)), neg(s(x1)))
if(true, x0, x1)
if(false, x0, x1)
minus_nat_s(x0, 0)
minus_nat_s(0, s(x0))
minus_nat_s(s(x0), s(x1))
minus_int(pos(x0), pos(x1))
minus_int(neg(x0), neg(x1))
minus_int(neg(x0), pos(x1))
minus_int(pos(x0), neg(x1))
and(false, false)
and(false, true)
and(true, false)
and(true, true)
We have to consider all minimal (P,Q,R)-chains.